The Distance Irregular Reflexive k-Labeling of Graphs
نویسندگان
چکیده
A total k-labeling is a function fe from the edge set to {1, 2, . , ke} and fv vertex {0, 4, 2kv}, where k = max{ke, 2kv}. distance irregular reflexive of graph G k-labeling, if for every two different vertices u 0 G, w(u) 6= w(u ), Σui∈N(u)fv(ui) + Σuv∈E(G)fe(uv). The minimum which has k-labelling called strength denoted by Dref (G). In this paper, we determine exact value some connected graphs, namely path, star, friendship graph.
منابع مشابه
(k, r)-Arithmetic Distance Compatible Set-Labeling of Graphs
Distance compatible set-labeling of a graph G is an injective setassignment f : V (G) → 2X , X a nonempty ground set, such that the corresponding induced function f⊕ : V (G)× V (G) → 2X −{∅}, defined by f⊕(u, v) = f(u) ⊕ f(v) satisfies | f⊕(u, v) |= k (u,v) d(u, v) for all distinct u, v ∈ V (G), where d(u, v) is the distance between u and v, and k (u,v) is a constant, not necessarily an integer...
متن کاملLabeling Irregular Graphs with Belief Propagation
This paper proposes a statistical approach to labeling images using a more natural graphical structure than the pixel grid (or some uniform derivation of it such as square patches of pixels). Typically, low-level vision estimations based on graphical models work on the regular pixel lattice (with a known clique structure and neighborhood). We move away from this regular lattice to more meaningf...
متن کاملDistance Labeling in Hyperbolic Graphs
A graph G is δ-hyperbolic if for any four vertices u, v, x, y of G the two larger of the three distance sums dG(u, v) + dG(x, y), dG(u, x) + dG(v, y), dG(u, y) + dG(v, x) differ by at most δ, and the smallest δ > 0 for which G is δ-hyperbolic is called the hyperbolicity of G. In this paper, we construct a distance labeling scheme for bounded hyperbolicity graphs, that is a vertex labeling such ...
متن کاملDistance Labeling for Permutation Graphs
We show that every permutation graph with n elements can be preprocessed in O(n) time, if two linear extensions of the corresponding poset are given, to produce an O(n) space data-structure supporting distance queries in constant time. The datastructure is localized and given as a distance labeling, that is each vertex receives a label of O(log n) bits so that distance queries between any two v...
متن کاملtotal $k$-distance domination critical graphs
a set $s$ of vertices in a graph $g=(v,e)$ is called a total$k$-distance dominating set if every vertex in $v$ is withindistance $k$ of a vertex in $s$. a graph $g$ is total $k$-distancedomination-critical if $gamma_{t}^{k} (g - x) < gamma_{t}^{k}(g)$ for any vertex $xin v(g)$. in this paper,we investigate some results on total $k$-distance domination-critical of graphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Cauchy
سال: 2023
ISSN: ['2477-3344', '2086-0382']
DOI: https://doi.org/10.18860/ca.v7i4.19747